Densely defined selections of multivalued mappings

Multivalued Possibilities Mappings

Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples are given of situations in which it is useful to allow the abstraction mappings to be muttivalued. The examples involve algorithm optimization, algorithm distribution, and proofs of time bounds.

Densely Defined Equilibrium Problems

In the present work we deal with set-valued equilibrium problems for which we provide sufficient conditions for the existence of a solution. The conditions that we consider are imposed not on the whole domain, but rather on a self segment-dense subset of it, a special type of dense subset. As an application, we obtain a generalized Debreu-Gale-Nikaido type theorem, with a considerable weakned W...

Degree of mapping for nonlinear mappings of monotone type: Densely defined mapping.

The classical degree function constructed earlier for pseudomonotone mappings has been used to develop a broader degree theory of classical type for the sum of a maximal monotone map from a reflexive Banach space to its dual together with a bounded pseudomonotone map. The proof uses the generalized Yosida approximation of the maximal monotone mapping.

Endpoints of generalized $phi$-contractive multivalued mappings of integral type

Recently‎, some researchers have established some results on existence of endpoints for multivalued mappings. In particular, Mohammadi and Rezapour's [Endpoints of Suzuki type quasi-contractive multifunctions, U.P.B. Sci. Bull., Series A, 2015] used the technique of $alpha-psi$-contractive mappings, due to Samet et al. (2012), to give some results about endpoints of Suzuki type quasi-contractiv...

Densely Deened Selections of Set-valued Mappings and Applications to the Geometry of Banach Spaces and Optimization